Complexity-theoretic algebra II: Boolean algebras

Complexity Theoretic Model Theory and Algebra

In this paper we will survey some recent results on complexity theoretic model theory and algebra Essentially there are two major themes in this work The rst which we call complexity theoretic model theory deals with model ex istence questions For example given a recursive model A is there there a polynomial time exponential time polynomial space etc model B which is isomorphic to A The second ...

Boolean Algebras And Natural Language: A Measurement Theoretic Approach

Dresner BOOLEAN ALGEBRAS AND NATURAL LANGUAGE : A MEASUREMENT THEORETIC

An algebraic structure is a set with one or more operations defined on it. For example, the natural numbers with addition and multiplication are such a structure. An algebraic structure A is a Boolean algebra if it has two binary operations (∗ and +), one unary operation (∼), and two designated elements (0 and 1) such that for any x, y and z from A (x, y and z are variables whose domain is the ...

Splitting Algebras Ii: the Cohomology Algebra

Gelfand, Retakh, Serconek and Wilson, in [3], defined a graded algebra AΓ attached to any finite ranked poset Γ a generalization of the universal algebra of pseudo-roots of noncommutative polynomials. This algebra has since come to be known as the splitting algebra of Γ. The splitting algebra has a secondary filtration related to the rank function on the poset and the associated graded algebra ...

Open problems in number theoretic complexity, II